The Parameterized Complexity of Domination-type Problems and Application to Linear Codes

We study the parameterized complexity of domination-type problems. (sigma,rho)-domination is a general and unifying framework introduced by Telle: a set D of vertices of a graph G is (sigma,rho)-dominating if for any v in D, |N(v)\cap D| in sigma and for any $v\notin D, |N(v)\cap D| in rho. We mainly show that for any sigma and rho the problem of (sigma,rho)-domination is W[2] when parameterized by the size of the dominating set. This general statement is optimal in the sense that several particular instances of (sigma,rho)-domination are W[2]-complete (e.g. Dominating Set). We also prove that (sigma,rho)-domination is W[2] for the dual parameterization, i.e. when parameterized by the size of the dominated set. We extend this result to a class of domination-type problems which do not fall into the (sigma,rho)-domination framework, including Connected Dominating Set. We also consider problems of coding theory which are related to domination-type problems with parity constraints. In particular, we prove that the problem of the minimal distance of a linear code over Fq is W[2] for both standard and dual parameterizations, and W[1]-hard for the dual parameterization. To prove W[2]-membership of the domination-type problems we extend the Turing-way to parameterized complexity by introducing a new kind of non deterministic Turing machine with the ability to perform `blind' transitions, i.e. transitions which do not depend on the content of the tapes. We prove that the corresponding problem Short Blind Multi-Tape Non-Deterministic Turing Machine is W[2]-complete. We believe that this new machine can be used to prove W[2]-membership of other problems, not necessarily related to dominationComment: 19 pages, 2 figure

The Turing way to parameterized complexity

We propose a general proof technique based on the Turing machine halting problem that allows us to establish membership results for the classes W[1], W[2], and W[P]. Using this technique, we prove that Perfect Code belongs to W[1], Steiner Tree belongs to W[2], and α-Balanced Separator, Maximal Irredundant Set, and Bounded DFA Intersection belong to W[P]

Hard real-time performances in multiprocessor-embedded systems using ASMP-Linux

Multiprocessor systems, especially those based on multicore or multithreaded processors, and new operating system architectures can satisfy the ever increasing computational requirements of embedded systems.ASMP-LINUX is a modified, high responsiveness, open-source hard real-time operating system for multiprocessorsystems capable of providing high real-time performance while maintaining the code simple and not impacting on theperformances of the rest of the system. Moreover, ASMP-LINUX does not require code changing or application recompiling/relinking.In order to assess the performances of ASMP-LINUX, benchmarks have been performed on several hardware platformsand configurations

Towards Work-Efficient Parallel Parameterized Algorithms

Parallel parameterized complexity theory studies how fixed-parameter tractable (fpt) problems can be solved in parallel. Previous theoretical work focused on parallel algorithms that are very fast in principle, but did not take into account that when we only have a small number of processors (between 2 and, say, 1024), it is more important that the parallel algorithms are work-efficient. In the present paper we investigate how work-efficient fpt algorithms can be designed. We review standard methods from fpt theory, like kernelization, search trees, and interleaving, and prove trade-offs for them between work efficiency and runtime improvements. This results in a toolbox for developing work-efficient parallel fpt algorithms.Comment: Prior full version of the paper that will appear in Proceedings of the 13th International Conference and Workshops on Algorithms and Computation (WALCOM 2019), February 27 - March 02, 2019, Guwahati, India. The final authenticated version is available online at https://doi.org/10.1007/978-3-030-10564-8_2

Portable, scalable, per-core power estimation for intelligent resource management

Performance, power, and temperature are now all first-order design constraints. Balancing power efficiency, thermal constraints, and performance requires some means to convey data about real-time power consumption and temperature to intelligent resource managers. Resource managers can use this information to meet performance goals, maintain power budgets, and obey thermal constraints. Unfortunately, obtaining the required machine introspection is challenging. Most current chips provide no support for per-core power monitoring, and when support exists, it is not exposed to software. We present a methodology for deriving per-core power models using sampled performance counter values and temperature sensor readings. We develop application-independent models for four different (four- to eight-core) platforms, validate their accuracy, and show how they can be used to guide scheduling decisions in power-aware resource managers. Model overhead is negligible, and estimations exhibit 1.1%-5.2% per-suite median error on the NAS, SPEC OMP, and SPEC 2006 benchmarks (and 1.2%-4.4% overall)

Investigating serum and tissue expression identified a cytokine/chemokine signature as a highly effective melanoma marker

The identification of reliable and quantitative melanoma biomarkers may help an early diagnosis and may directly affect melanoma mortality and morbidity. The aim of the present study was to identify effective biomarkers by investigating the expression of 27 cytokines/chemokines in melanoma compared to healthy controls, both in serum and in tissue samples. Serum samples were from 232 patients recruited at the IDI-IRCCS hospital. Expression was quantified by xMAP technology, on 27 cytokines/chemokines, compared to the control sera. RNA expression data of the same 27 molecules were obtained from 511 melanoma-and healthy-tissue samples, from the GENT2 database. Statistical analysis involved a 3-step approach: analysis of the single-molecules by Mann–Whitney analysis; analysis of paired-molecules by Pearson correlation; and profile analysis by the machine learning algorithm Support Vector Machine (SVM). Single-molecule analysis of serum expression identified IL-1b, IL-6, IP-10, PDGF-BB, and RANTES differently expressed in melanoma (p < 0.05). Expression of IL-8, GM-CSF, MCP-1, and TNF-α was found to be significantly correlated with Breslow thickness. Eotaxin and MCP-1 were found differentially expressed in male vs. female patients. Tissue expression analysis identified very effective marker/predictor genes, namely, IL-1Ra, IL-7, MIP-1a, and MIP-1b, with individual AUC values of 0.88, 0.86, 0.93, 0.87, respectively. SVM analysis of the tissue expression data identified the combination of these four molecules as the most effective signature to discriminate melanoma patients (AUC = 0.98). Validation, using the GEPIA2 database on an additional 1019 independent samples, fully confirmed these observations. The present study demonstrates, for the first time, that the IL-1Ra, IL-7, MIP-1a, and MIP-1b gene signature discriminates melanoma from control tissues with extremely high efficacy. We therefore propose this 4-molecule combination as an effective melanoma marker

Independent Sets in Restricted Line of Sight Networks

Line of Sight (LoS) networks were designed to model wireless networks in settings which may contain obstacles restricting visibility of sensors. A grap